Turing reduction - PDFSEARCH.IO - Document Search Engine

Turing reduction
Results: 43

#	Item
11	cSplash, Event for High School Students, Courant Institute What is the Numerical Halting Problem? Chee Yap Computer Science Dept, Courant, NYU Mar 29, 2008 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-02-22 12:21:24 Computer science Theory of computation Models of computation Formal methods Alan Turing Computability Halting problem Turing machine Reduction Theoretical computer science Applied mathematics Computability theory
12	Fundamentals of Computing Leonid A. Levin These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2015-03-30 07:56:29 Computer science Theory of computation Alan Turing Turing machine Models of computation Computable function Turing reduction Universal Turing machine Halting problem Computability theory Theoretical computer science Mathematics
13	Lecture XXX Page 1 “The field of mechanical theorem proving badly needs a basis for comparing and evaluating the dozens of procedures which appear in the literature. Performance of a Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-11-21 18:33:24 Complexity classes P Time complexity Algorithm Reduction Turing machine EXPTIME Computability L Theoretical computer science Computational complexity theory Applied mathematics
14	Computable Structures: Presentations Matter Richard A. Shore∗ Department of Mathemcatics Cornell Univeristy Ithaca NY 14853 Add to Reading List Source URL: www.math.cornell.edu Language: English - Date: 1999-12-01 12:15:32 Applied mathematics Logic Computable isomorphism Turing reduction Recursive set Enumeration Low Recursively enumerable set Mathematical logic Computability theory Theory of computation Mathematics
15	Solutions of the Goncharov-Millar and Degree Spectra Problems in The Theory of Computable Models Bakhadyr Khoussainov The University of Auckland New Zealand Add to Reading List Source URL: www.math.cornell.edu Language: English - Date: 1999-11-18 16:33:20 Computer science Mathematics Computable function Recursive set Recursively enumerable set Turing reduction Computable isomorphism Low RE Computability theory Theoretical computer science Theory of computation
16	Symposium on Theoretical Aspects of Computer Science[removed]Nancy, France), pp[removed]www.stacs-conf.org COLLAPSING AND SEPARATING COMPLETENESS NOTIONS UNDER AVERAGE-CASE AND WORST-CASE HYPOTHESES XIAOYANG GU 1 AND JOHN Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2010-03-04 08:18:12 Complexity classes NP-complete NP Reduction P/poly Advice Many-one reduction Turing reduction Polynomial-time reduction Theoretical computer science Computational complexity theory Applied mathematics
17	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes
18	Complexity-theoretic barriers to validated solution of initial value problems Aki K AWAMURA www.cs.toronto.edu/˜kawamura/ Department of Computer Science Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2008-05-30 11:12:20 Computer science Models of computation Theory of computation Computational complexity theory Oracle machine Reduction Computability Turing machine Algorithm Theoretical computer science Computability theory Applied mathematics
19	comput. complex[removed]), 117 – [removed]020117–22 $ 1.50[removed]c Birkh¨ auser Verlag, Basel 2001 Add to Reading List Source URL: ftp.cs.rutgers.edu Language: English - Date: 2001-11-08 10:48:45 Complexity classes Circuit complexity ACC0 FO Majority function Time complexity AC Turing reduction NP-complete Theoretical computer science Computational complexity theory Applied mathematics
20	Error Limiting Reductions Between Classification Tasks Alina Beygelzimer IBM T. J. Watson Research Center, Hawthorne, NY[removed]removed] Add to Reading List Source URL: www.machinelearning.org Language: English - Date: 2008-12-01 11:14:46 Applied mathematics Statistical classification Margin classifier Division Supervised learning Algorithm Turing reduction Machine learning Statistics Mathematics

UPDATE